An algebraic theory for web service contracts
نویسندگان
چکیده
منابع مشابه
The must preorder revisited – an algebraic theory for web services contracts –
We define a language for Web services contracts as a parallelfree fragment of ccs and we study a natural notion of compliance between clients and services in terms of their corresponding contracts. The induced contract preorder turns out to be valuable in searching and querying registries of Web services, it shows interesting connections with the must preorder, and it exhibits good precongruenc...
متن کاملSemi-Automated Management of Web Service Contracts
Service-oriented computing as a concept for providing interoperability and flexibility within heterogeneous environments has gained much attention within the last few years. Dynamically integrating external Web services into enterprise applications requires automatic contracting between service requestors and providers and automatic contract monitoring. This paper suggests a semi-automatic appr...
متن کاملContracts for Cooperation between Web Service Programmers and HTML Designers
Interactive Web services consist of a mixture of HTML fragments and program code. The fragments, which are maintained by designers, are combined to form HTML pages that are shown to the clients. The code, which is maintained by programmers, is executed on the server to handle the business logic. Current Web service frameworks provide little help in separating these constituents, which complicat...
متن کاملLifecycle for Management of E-contracts Based on Web Service
Electronic contracts (e-contracts) create obligations, permissions, and prohibitions for the parties in the Internet. However, the support to interpret and enforce the clauses related to contracts is limited in current implementations. Besides, e-contracts must follow the continuous change of business rules. The service provider must make available the services that enable the parties to satisf...
متن کاملA theory of contracts for strong service compliance
We investigate, in a process algebraic setting, a new notion of correctness for service compositions that we call strong service compliance: composed services are strong compliant if their composition is both deadlock and livelock free (this is the traditional notion of compliance) and whenever a message can be sent to invoke a service, this service is ensured to be ready to serve the invocatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Aspects of Computing
سال: 2015
ISSN: 0934-5043,1433-299X
DOI: 10.1007/s00165-015-0334-2